GCA: A Massively Parallel Model
نویسندگان
چکیده
We had introduced the massively parallel global cellular automata (GCA) model. Parallel algorithms derived from applications can be mapped straight forward onto this model. In this model a cell in the cell field is dynamically connected (access pattern, dynamic neighbourhood) to other cells. The model can be implemented by pointers stored in the cell state. Via these pointers, each cell has read access to any other cell in the cell field, and the pointers may be changed from generation to generation. We have investigated different types of the model in order of minimize hardware/software implementation cost. So we have classified the GCA into types with respect to space, time or data dependency of the access pattern. We have investigated a number of different GCA algorithms and found out, that in most cases a time dependent access pattern is sufficient. To find out the usefulness of the data dependent access pattern we constructed a sophisticated merge sort algorithm, in which the target addresses are computed in contrast to classical algorithms where the data elements are moved. It turned out, that we could not achieve a speed up which we expected compared to an algorithm implemented on the more simple time dependent model. This is another confirmation that it is sufficient to implement only the time and space dependent model and thus reduce the hardware/software implementation cost.
منابع مشابه
A Multiprocessor Architecture with an Omega Network for the Massively Parallel Model GCA
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical CA (Cellular Automata) model. In differentiation to the CA model the neighbors are not fixed and local, they are variable and global. The GCA model is applicable to a wide range of parallel algorithms. In this paper a...
متن کاملGCA Multi-Softcore Architecture for Agent Systems Simulation
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical CA (Cellular Automata) model. In differentiation to the CA model the neighbors are not fixed and local, they are variable and global. The GCA model is applicable to a wide range of parallel algorithms. The application...
متن کاملSpecialized Multicore Architectures Supporting Efficient Multi-Agent Simulations
Two new multiprocessor architectures to accelerate the simulation of multi-agent systems based on the massively parallel GCA (Global Cellular Automata) model are presented. The GCA model is suited to describe and simulate different multi-agent systems. The designed and implemented architectures mainly consist of a set of processors (NIOS II) and a network. The multiprocessor systems allow the i...
متن کاملKonfigurierbare Prozessorsysteme zur hardwareunterstützten Simulation von Agentensystemen auf der Basis von globalen zellularen Automaten
In this work several different hardware architectures for the GCA-model (Global Cellular Automata, GCA) have been developed, evaluated and optimized for the simulation of multi-agent systems. The GCA-model consists of a set of cells which change their states synchronously parallel depending on the states of the neighbor cells. Therefore it is a massively parallel computation model. In different...
متن کامل